| 1. | A fast point visibility algorithm for simple polygon
简单多边形可见点问题的快速求解算法 |
| 2. | Algorithm on the convex hull of a simple polygon
简单多边形凸包的算法 |
| 3. | An algorithm for connecting non - intersecting line segments into a simple polygon
一种用射影线束族生成曲线的方法 |
| 4. | Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry
摘要简单多边形凸单元剖分是计算几何的基本问题之一，剖分算法在许多领域均有较广泛的应用。 |
| 5. | In order to prove i am alive , i write a simple algorithm to generate simple polygon from a set of points because i only think when i do coding
身为科技外语系主任的刘教授终于想出一个他知道合适的英文单词，同时借机一仰脖又喝一杯。 |
| 6. | An old theorem from the first half of the nineteenth century by lowry , wallace , bolyai and gerwien asserts that any simple polygon can be dissected into a finite number of pieces and put back together to form any other simple polygon of the same area
十九世纪上半叶lowry ， wallace ， bolyai与gerwien同时证明了一个古老的数学命题：任意给定平面上一个简单多边形，必可将其分划成有限块，重新安排，拼成另一个任意给定的等面积的简单多边形。 |
| 7. | To fulfill the need of the application of rp technique in medical domain , reverse cad modeling from medical cross sections is systematically studied in this dissertation . firstly , some algorithms related to the research of this dissertation are studied . new algorithms for orientation and inclusion test for simple polygon , an error constrained automatic faring algorithm for b - spline curve and a theorem regarding the termination criterion for subdivision of triangular bezier patch are proposed
本文针对rp技术在医学领域应用的需要，系统研究了基于医学断层轮廓数据的反求cad建模理论和方法： ( 1 )在基础算法研究部分，提出了简单多边形方向及点在多边形内外判断的新方法、三角b zier曲面片离散的误差控制定理和一种带误差约束的b样条曲线的自动光顺方法； ( 2 )提出了一种基于相邻层轮廓相似性的医学断层轮廓数据曲面重构方法； ( 3 )提出了一种称为“虚拟测量”的曲面模型处理方法。 |
| 8. | Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly . new algorithms for orientation and inclusion test for simple polygon are proposed . and ghosh ' s convex hull algorithms for simple polygon and convex polygons , subramanian ' s triangulation algorithm for arbitrary planar domain and o ' rourke ' s intersection algorithm for convex polygons are modified to make them more robust
断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了subramanian的平面多连通域的三角划分方法、 ghosh的多边形的凸包及多个多边形的凸包算法和o ' rourke的凸多边形的求交算法。 |
